Team Contests with Multiple Pairwise Battles
نویسندگان
چکیده
منابع مشابه
Team Contests with Multiple Pairwise Battles∗
We study a contest between two teams. The teams include an equal number of players. Each player of a team participates in a component battle, competing against a matched rival from the other team. A team wins if and only if its players prevail in a suffi ciently large number of component battles. The winning team is awarded a prize, which is a public good for all its players. In addition, a pla...
متن کاملContests with multiple rounds
This paper studies contests where players have the ßexibility to add to their previous efforts after observing their rivals most recent effort in an intermediate stage. It is found that (1) contrary to previous Þndings, the Stackelberg outcome where the underdog leads and the favorite follows cannot be an equilibrium. (2) There are multiple subgame perfect equilibria all occuring on the underd...
متن کامل[Listeria battles with SUMO].
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملCycles in Team Tennis and Other Paired-Element Contests
Team Tennis competitions produce aggregate scores for teams, and thus team rankings, based on head-to-head matchups of individual team members. Similar scoring rules can be used to rank any two groups that must be compared on the basis of paired elements. We explore such rules in terms of their strategic and social choice characteristics, with particular emphasis on the role of cycles. We first...
متن کاملMultiple-instance learning with pairwise instance similarity
Multiple-Instance Learning (MIL) has attracted much attention of the machine learning community in recent years and many real-world applications have been successfully formulated as MIL problems. Over the past few years, several Instance Selection-based MIL (ISMIL) algorithms have been presented by using the concept of the embedding space. Although they delivered very promising performance, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Economic Review
سال: 2015
ISSN: 0002-8282
DOI: 10.1257/aer.20121469